منابع مشابه
Sagittarius: the Nearest Dwarf Galaxy
We have discovered a new Galactic satellite galaxy in the constellation of Sagittar-ius. The Sagittarius dwarf galaxy subtends an angle of 10 degrees on the sky, lies at a distance of 24 kpc and is comparable in size and luminosity to the largest dwarf spheroidal, Fornax. The new galaxy has many features in common with the other eight Galactic dwarf spheroidal systems: including an extended low...
متن کاملAn accurate distance to 2 M 1207 Ab ?
Context. In April 2004 the first image was obtained of a planetary mass companion (now known as 2M1207 b) in orbit around a selfluminous object different from our own Sun (the young brown dwarf 2MASSW J1207334-393254, hereafter 2M1207 A). 2M1207 b probably formed via fragmentation and gravitational collapse, offering proof that such a mechanism can form bodies in the planetary mass regime. Howe...
متن کاملAn Accurate Distance to High - Velocity Cloud Complex C
We report an accurate distance of d = 10 ± 2.5 kpc to the high-velocity cloud Complex C. Using high signal-to-noise Keck/HIRES spectra of two horizontal-branch stars, we have detected Ca II K absorption lines from the cloud. Significant non-detections towards a further 3 stars yield robust lower distance limits.
متن کاملBounds for the Distance to the Nearest Correlation Matrix
In a wide range of practical problems correlation matrices are formed in such a way that, while symmetry and a unit diagonal are assured, they may lack semidefiniteness. We derive a variety of new upper bounds for the distance from an arbitrary symmetric matrix to the nearest correlation matrix. The bounds are of two main classes: those based on the eigensystem and those based on a modified Cho...
متن کاملBounds for the Componentwise Distance to the Nearest Singular Matrix
The normwise distance of a matrix A to the nearest singular matrix is well known to be equal to ‖A‖/cond(A) for norms being subordinate to a vector norm. However, there is no hope to find a similar formula or even a simple algorithm for computing the componentwise distance to the nearest singular matrix for general matrices. This is because Rohn and Poljak [7] showed that this is an NP -hard pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2013
ISSN: 0028-0836,1476-4687
DOI: 10.1038/495051a